Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs
نویسندگان
چکیده
Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (M.Mahdian, On the computational complexity of strong edge coloring, Discrete Applied Mathematics, 118:239–248, 2002) proved that it is in polynomial time for quadrilateral-free graphs and proposed an O(n) algorithm for the same (along with a note that by a straightforward but lengthy argument it can be proved to be solvable in O(n) running time). In this paper we propose an O(n) time algorithm for finding a maximum cardinality neighbourly set in a quadrilateral-free graph.
منابع مشابه
Neighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملFinding Independent Sets inK4-Free 4-Regular Connected Graphs
Let G be a K4-free 4-regular connected graph with & vertices. Then G contains an independent set of vertices of cardinality at least (7&&4) 26. Furthermore, the proof will yield a polynomial-time algorithm which will return an independent set of cardinality at least (7&&4) 26 for any such graph. A family of K4 -free 4-regular connected graphs with maximum independent set of cardinality 3 11& is...
متن کاملRelational Approximation of Maximum Independent Sets (Extended Abstract)
Previous work has shown that relation algebra (as introduced in [14] and further developed in [9,12,13,15], for example) is well suited for computational problems on many discrete structures. In particular, adjacency or incidence relations can be used tomodel graphs and special relations like vectors and points to represent subsets of vertices or edges, as shown in [12]. We develop and formally...
متن کاملMaximum Alliance-Free and Minimum Alliance-Cover Sets
A defensive k−alliance in a graph G = (V, E) is a set of vertices A ⊆ V such that for every vertex v ∈ A, the number of neighbors v has in A is at least k more than the number of neighbors it has in V −A (where k is the strength of defensive k−alliance). An offensive k−alliance is a set of vertices A ⊆ V such that for every vertex v ∈ ∂A, the number of neighbors v has in A is at least k more th...
متن کاملk-TUPLE DOMATIC IN GRAPHS
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 33 شماره
صفحات -
تاریخ انتشار 2017